Restricted signed permutations counted by the Schröder numbers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted signed permutations counted by the Schröder numbers

Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displayi...

متن کامل

Permutations, parenthesis words, and Schröder numbers

A different proof for the following result due to J. West is given: the Schröder number s n−1 equals the number of permutations on {1,

متن کامل

Permutations and words counted by consecutive patterns

Generating functions which count occurrences of consecutive sequences in a permutation or a word which matches a given pattern are studied by exploiting the combinatorics associated with symmetric functions. Our theorems take the generating function for the number of permutations which do not contain a certain pattern and give generating functions refining permutations by the both the total num...

متن کامل

Objects Counted by the Central Delannoy Numbers

The central Delannoy numbers, (dn)n≥0 = 1, 3, 13, 63, 321, 1683, 8989, 48639, . . . (A001850 of The On-Line Encyclopedia of Integer Sequences) will be defined so that dn counts the lattice paths running from (0, 0) to (n, n) that use the steps (1, 0), (0, 1), and (1, 1). In a recreational spirit we give a collection of 29 configurations that these numbers count.

متن کامل

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2006

ISSN: 0012-365X

DOI: 10.1016/j.disc.2006.01.013